﻿/**
 * 测试用的文件。提供了一个提交文件的模板，可以快速形成提交到PTA的答案。
 */

#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

#include "../Headers/Util.h"

using std::cin;
using std::cout;
using std::endl;
using std::vector;

constexpr double eps = 1e-8;

#ifdef OJMode

namespace Util {
    bool equal(double x, double y) {
        return (std::abs(x - y) <= eps);
    }

    bool less(double x, double y) {
        return x < y - eps;
    }

    bool more(double x, double y) {
        return x > y + eps;
    }

    bool lessEqual(double x, double y) {
        return !more(x, y);
    }

    bool moreEqual(double x, double y) {
        return !less(x, y);
    }

    std::vector<std::string> strSplit(std::string str, char delimiter) {
        std::vector<std::string> v;

        // 去除首尾的分隔符
        std::string::size_type begin = str.find_first_not_of(delimiter), end = str.find_last_not_of(delimiter);
        if (begin == std::string::npos) return v; // 全为分隔符或空串
        str = str.substr(begin, end - begin + 1);

        begin = 0;
        end = str.find(delimiter, begin);
        while (end != std::string::npos) {
            v.push_back(str.substr(begin, end - begin));
            if (end == str.length() - 1) return v; // 最后一个字符是分隔符
            begin = end + 1;
            end = str.find(delimiter, begin);
        }
        v.push_back(str.substr(begin, str.length() - begin)); // 最后一个子串，或中间没有分隔符
        return v;
    }

    std::vector<int> deci2AnyBase(int deci, int base) {
        std::vector<int> v;
        if (deci == 0) {
            v.push_back(0);
            return v;
        }
        else {
            int remainder = deci % base;
            if (deci / base > 0) v = deci2AnyBase(deci / base, base);
            v.push_back(remainder);
            return v;
        }
    }
}

#endif

int main() {
    std::vector<int> v;
    for (int i = 10; i >= 1; i--) {
        v.push_back(i);
    }
    Util::quickSort(v, 0, v.size());
    cout << "OK" << endl;
}